Probabilistic Propositional Planning: Representations and Complexity
نویسنده
چکیده
Many representations for probabilistic propositional planning problems have been studied. This paper reviews several such representations and shows that, in spite of superrcial diierences between the representations , they are \expressively equivalent," meaning that planning problems speciied in one representation can be converted to equivalent planning problems in any of the other representations with at most a polynomial factor increase in the size of the resulting representation and the number of steps needed to reach the goal with suucient probability. The paper proves that the computational complexity of determining whether a successful plan exists for planning problems expressed in any of these representations is EXPTIME-complete and PSPACE-complete when plans are restricted to take a polynomial number of steps.
منابع مشابه
robabilistic Propositional Planning: Representations and Complexity
Many representations for probabilistic propositional planning problems have been studied. This paper reviews several such representations and shows that, in spite of superficial differences between the represent at ions, they are “expressively equivalent ,” meaning that planning problems specified in one representation can be converted to equivalent planning problems in any of the other represe...
متن کاملThe Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan evaluation and existence varies with the plan type sought; we examine totally ordered plans, acyclic plans, and looping plans, and partially ordered plans under three natural de nitions of plan value. We show that probl...
متن کاملThe Complexity of Bayesian Networks Specified by Propositional and Relational Languages
We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover a variety of plate models and of probabilistic relational models. We study the complexity of inferences when network, query and domain are the input (the inf...
متن کاملProbabilistic logic with independence
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without independence, and then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first order probabilistic log...
متن کاملThe Computational Complexity of Probabilistic
We examine the computational complexity of testing and nding small plans in proba-bilistic planning domains with both at and propositional representations. The complexity of plan evaluation and existence varies with the plan type sought; we examine totally ordered plans, acyclic plans, and looping plans, and partially ordered plans under three natural deenitions of plan value. We show that prob...
متن کامل